Skolem's Paradox
نویسنده
چکیده
1. All natural numbers are in the domain. 2. The only other elements of the domain are sets of natural numbers. 3. The denotations of 0, 1, 2, ... are 0, 1, 2, ... respectively; the denotation of N is the set of all natural numbers, and the denotation of S is the set of all sets of natural numbers in the domain; the denotation of Î is the relation of membership between numbers and sets of numbers. Finally, the denotation of J is the function J extended to give some arbitrary value—say 17—for arguments that are not both numbers (that is, one or both of which are sets).
منابع مشابه
Reflections on Skolem’s Paradox
The Löwenheim-Skolem theorems say that if a first-order theory has infinite models, then it has models which are only countably infinite. Cantor's theorem says that some sets are uncountable. Together, these two theorems induce a puzzle known as Skolem's Paradox: the very axioms of (first-order) set theory which prove the existence of uncountable sets can themselves be satisfied by a merely cou...
متن کاملReflections on Skolem's Relativity of Set-Theoretical Concepts!
In this paper an attempt Is made to present Skolem's argument forthe relativity of some set-theoretical notions as a sensible one. Skolem's critiqueof set theory is seen as part of a larger argument to the effect that no conclusiveevidence has been given for the existence of uncountable sets. Some replies toSkolem are discussed and are shown not to affect Skolem's position, sinc...
متن کاملBertrand’s Paradox Revisited: More Lessons about that Ambiguous Word, Random
The Bertrand paradox question is: “Consider a unit-radius circle for which the length of a side of an inscribed equilateral triangle equals 3 . Determine the probability that the length of a ‘random’ chord of a unit-radius circle has length greater than 3 .” Bertrand derived three different ‘correct’ answers, the correctness depending on interpretation of the word, random. Here we employ geomet...
متن کاملThe Logical Roots of Indeterminacy
In contemporary terminology the theorem says that if a formula @ of first-order logic with identity is finitely valid but not valid, then for every cardinal A 2 No, @ is not A-valid (i.e., if -@ is satisfiable in an infinite model, then for every infinite cardinal A, -@ is satisfiable in a model of cardinality A).' It follows from this theorem, Lowenheim pointed out, that "[all1 questions conce...
متن کامل